Consensus of Nonlinear Complex Systems with Edge Betweenness Centrality Measure under Time-Varying Sampled-Data Protocol

نویسندگان

  • M. J. Park
  • O. M. Kwon
  • E. J. Cha
چکیده

This paper proposes a new consensus criterion for nonlinear complex systems with edge betweenness centrality measure. By construction of a suitable Lyapunov-Krasovskii functional, the consensus criterion for such systems is established in terms of linear matrix inequalities (LMIs) which can be easily solved by various effective optimization algorithms. One numerical example is given to illustrate the effectiveness of the proposed methods.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mathematical Problems for Complex Systems

As most of practical systems have high complexity, complex systems have become a rapidly growing area of mathematics and attracted many researchers. The study of complex systems not only has an important theoretical interest but also is motivated by problems from applied mathematics including physics, chemistry, astronomy, technology, and natural and social sciences. It should be noted that som...

متن کامل

A new virtual leader-following consensus protocol to internal and string stability analysis of longitudinal platoon of vehicles with generic network topology under communication and parasitic delays

In this paper, a new virtual leader following consensus protocol is introduced to perform the internal and string stability analysis of longitudinal platoon of vehicles under generic network topology. In all previous studies on multi-agent systems with generic network topology, the control parameters are strictly dependent on eigenvalues of network matrices (adjacency or Laplacian). Since some ...

متن کامل

Removing spurious interactions in complex networks

Identifying and removing spurious links in complex networks is meaningful for many real applications and is crucial for improving the reliability of network data, which, in turn, can lead to a better understanding of the highly interconnected nature of various social, biological, and communication systems. In this paper, we study the features of different simple spurious link elimination method...

متن کامل

Communicability Angles Reveal Critical Edges for Network Consensus Dynamics

We consider the question of determining how the topological structure influences a consensus dynamical processes taking place on a network. By considering a large data set of real-world networks we first determine that the removal of edges according to their communicability angle, an angle between position vectors of the nodes in an Euclidean communicability space, increases the average time of...

متن کامل

Local Edge Betweenness based Label Propagation for Community Detection in Complex Networks

Nowadays, identification and detection community structures in complex networks is an important factor in extracting useful information from networks. Label propagation algorithm with near linear-time complexity is one of the most popular methods for detecting community structures, yet its uncertainty and randomness is a defective factor. Merging LPA with other community detection metrics would...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره 2015  شماره 

صفحات  -

تاریخ انتشار 2015